Thelowestcommonancestoroftwonodesinatreeroot.val>=p.val&&root.val<=q.val.题目链接：【树中两个节点的最低公共祖先】()code/***题目：树中两个节点的最低公共祖先*/publicclassJz76{/***二叉搜索树*二分搜索在树中，两个节点p、q的共同祖先根满足root.val>=p.val&&root.val<=q.val。**@paramroot*@paramp*@paramq*@return*/publicTreeNodelowestCommonAncestor(TreeNoderoot,TreeNodep,TreeNodeq){if(root==null){returnroot;}if(root.val>p.val&&root.val>q.val){returnlowestCommonAncestor(root.left,p,q);}if(root.val
