How to get height of binary tree and root to leaf path in C
Question
I have a binary tree and I need to know the height(defined as the maximum level of the tree) and I also need to find the shortest path from the root to any leaf. How do I do that in C?
1 answers
solution1
2 2011-08-05 13:09:42
Any elementary programming course will provide an answer. See http://cslibrary.stanford.edu/110/BinaryTrees.html for example.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
How to compare root to leaf paths in a binary tree
Binary tree - print leaf-to-leaf path [C]
How would you get a list of height unbalanced leaf nodes in a binary search tree?
Java/C/C++:find leaf of the shortest path of a binary tree without reconstructing tree (help with recursion)
Ensure every path from root to a tree leaf node has the same number of black nodes ( C )
Given a binary tree, return all root-to-leaf paths
How to find a leaf node in a binary NOT SORTED tree
Delete a leaf node in binary tree
C: Finding Huffman-coded path of specific leaf in tree
How to count number of leaf nodes in a binary tree using queue?
Related Tags