[자료구조] Program to find the nodes which are at the maximum distance in a Binary Tree
원문 링크 https://www.javatpoint.com/program-to-find-the-nodes-which-are-at-the-maximum-distance-in-a-binary-tree Program to Find the Nodes Which are at the Maximum Distance in a Binary Tree - javatpoint Program to Find the Nodes Which are at the Maximum Distance in a Binary Tree on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc...
2020. 3. 19.
[자료구조] Program to find maximum width of a binary tree
원문 링크 : https://www.javatpoint.com/program-to-find-maximum-width-of-a-binary-tree Program to Find Maximum Width of a Binary Tree - javatpoint Program to Find Maximum Width of a Binary Tree on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc. www.javatpoint.com 여기서 width란 한 level의 node의 수를 의미한다. 따라서 maximum width라 함은, 한 level에 있..
2020. 3. 19.
[자료구조] Program to determine whether two trees are identical
원문링크 : https://www.javatpoint.com/program-to-determine-whether-two-trees-are-identical Program to Determine Whether two Trees are Identical - javatpoint Program to Determine Whether two Trees are Identical on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc. www.javatpoint.com 초기 알고리즘 구상 exception if root is null compare group ..
2020. 3. 10.
