[LeetCode] Maximum Depth of N-ary Tree N叉樹的最大深度
Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down ...
原文：[LeetCode] Encode N-ary Tree to Binary Tree 將N叉樹編碼為二叉樹
Design an algorithm to encode an N ary tree into a binary tree and decode the binary tree to get the original N ary tree. An N ary tree is a rooted tree in which each node has no more than N children ...
2018-11-12 11:08 4 2260 推薦指數：
相關推薦
[LeetCode] 589. N-ary Tree Postorder Traversal N叉樹的后序遍歷
Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return its postorder ...
[LeetCode] N-ary Tree Preorder Traversal N叉樹的前序遍歷
Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal ...
[LeetCode] N-ary Tree Level Order Traversal N叉樹層序遍歷
Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example, given a 3-ary ...
二叉樹（binary tree）
在寫這篇文章之前說一下數據結構和算法這個系列，這個系列包含了很多東西，比如啥子排序，線性表，廣義表，樹，圖這些大家都是知道的，但是這些東西我們學了之后工作中能用到的又有多少呢，據我所知絕大部分公司，一 ...
[LeetCode] 543. Diameter of Binary Tree 二叉樹的直徑
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path ...
[LeetCode] Print Binary Tree 打印二叉樹
Print a binary tree in an m*n 2D string array following these rules: The row number m should be equal to the height of the given binary tree ...
[LeetCode] Binary Tree Tilt 二叉樹的坡度
Given a binary tree, return the tilt of the whole tree. The tilt of a tree node is defined as the absolute difference between the sum of all left ...