\u9898\u76ee\uff1a\u8f93\u5165\u67d0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386\u9ed1\u591c\u4e2d\u5e8f\u904d\u5386\u7684\u7ed3\u679c\uff0c\u8bf7\u91cd\u5efa\u51fa\u8be5\u4e8c\u53c9\u6811\u3002\u5047\u8bbe\u8f93\u5165\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u4e2d\u90fd\u4e0d\u5305\u542b\u91cd\u590d\u7684\u6570\u5b57\u3002\u4f8b\u5982\u8f93\u5165\u524d\u5e8f\u904d\u5386\u5e8f\u5217{1, 2, 4, 7, 3, 5, 6, 8}\u548c\u4e2d\u5e8f\u904d\u5386 {4\uff0c 7\uff0c 2\uff0c 1\uff0c 5\uff0c 3\uff0c 8\uff0c 6}\uff0c\u5219\u91cd\u5efa\u51fa\u8be5\u4e8c\u53c9\u6811\u3002<\/p>
C#\u5b9e\u73b0\uff1a<\/strong><\/p> public class BinaryTreeNode Java\u5b9e\u73b0\uff1a<\/strong><\/p> public class BinaryTreeNode {
{
int value;
BinaryTreeNode left;
BinaryTreeNode right;
public static BinaryTreeNode Construct(ArrayList preorder, ArrayList inOrder)
{
if (preorder == null || inOrder == null || preorder.Count != inOrder.Count
|| preorder.Count <=0 || inOrder.Count <=0)
return null;
return ConstructCore(preorder, inOrder);
}
public static BinaryTreeNode ConstructCore(ArrayList preorder, ArrayList inOrder)
{
int rootValue = (int)preorder[0];
BinaryTreeNode root = new BinaryTreeNode();
root.value = rootValue;
int pos = inOrder.IndexOf(rootValue);
if (pos > 0) \/\/ \u6839\u503c\u7684\u5de6\u8fb9\u8fd8\u6709\u5143\u7d20
{
root.left = ConstructCore(preorder.GetRange(1, pos), inOrder.GetRange(0, pos));
}
if (pos < inOrder.Count - 1) \/\/ \u6839\u503c\u7684\u53f3\u8fb9\u8fd8\u6709\u5143\u7d20
{
root.right = ConstructCore(preorder.GetRange(pos + 1, preorder.Count - pos - 1),
inOrder.GetRange(pos + 1, inOrder.Count - pos - 1));
}
return root;
}
}<\/p>
int value;
BinaryTreeNode left;
BinaryTreeNode right;
\/\/ \u8f93\u5165\u67d0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386\u9ed1\u591c\u4e2d\u5e8f\u904d\u5386\u7684\u7ed3\u679c\uff0c\u8bf7\u91cd\u5efa\u51fa\u8be5\u4e8c\u53c9\u6811\u3002\u5047\u8bbe\u8f93\u5165\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386
\/\/ \u4e2d\u90fd\u4e0d\u5305\u542b\u91cd\u590d\u7684\u6570\u5b57\u3002\u4f8b\u5982\u8f93\u5165\u524d\u5e8f\u904d\u5386\u5e8f\u5217{1, 2, 4, 7, 3, 5, 6, 8}\u548c\u4e2d\u5e8f\u904d\u5386
\/\/ {4\uff0c 7\uff0c 2\uff0c 1\uff0c 5\uff0c 3\uff0c 8\uff0c 6}\uff0c\u5219\u91cd\u5efa\u51fa\u8be5\u4e8c\u53c9\u6811
public static BinaryTreeNode Construct(List<Integer> preOrder, List<Integer> inOrder) {
if (preOrder == null || inOrder == null || preOrder.size() != inOrder.size() || preOrder.size() <= 0
|| inOrder.size() <= 0)
return null;
return ConstructCore(preOrder, inOrder);
}
public static BinaryTreeNode ConstructCore(List<Integer> preOrder, List<Integer> inOrder) {
int rootValue = preOrder.get(0);
BinaryTreeNode root = new BinaryTreeNode();
root.value = rootValue;
int pos = inOrder.indexOf(rootValue);
if (pos > 0) \/\/ \u6839\u503c\u7684\u5de6\u8fb9\u8fd8\u6709\u5143\u7d20
{
&n","orderid":"0","title":"\u91cd\u5efa\u4e8c\u53c9\u6811(\u4e00)","smalltitle":"","mid":"0","fname":"linux\u7f16\u7a0b\u57fa\u7840","special_id":"0","bak_id":"0","info":"0","hits":"9734","pages":"2","comments":"0","posttime":"2017-10-18 09:07:50","list":"1508288870","username":"admin","author":"","copyfrom":"","copyfromurl":"","titlecolor":"","fonttype":"0","titleicon":"0","picurl":"https:\/\/www.cppentry.com\/upload_files\/","ispic":"0","yz":"1","yzer":"","yztime":"0","levels":"0","levelstime":"0","keywords":"\u91cd\u5efa<\/A>","jumpurl":"","iframeurl":"","style":"","template":"a:3:{s:4:\"head\";s:0:\"\";s:4:\"foot\";s:0:\"\";s:8:\"bencandy\";s:0:\"\";}","target":"0","ip":"113.108.110.181","lastfid":"0","money":"0","buyuser":"","passwd":"","allowdown":"","allowview":"","editer":"","edittime":"0","begintime":"0","endtime":"0","description":"\u91cd\u5efa\u4e8c\u53c9\u6811","lastview":"1702370118","digg_num":"2761","digg_time":"1711483549","forbidcomment":"0","ifvote":"0","heart":"","htmlname":"","city_id":"0"},"page":"1"}