-
So, actually I want you to go ahead in your notes and circle that zero point and write "not a node."
在你们笔记上把这个零点圈出来,在旁边写上“不是节点“,它不是节点“
-
Yup, so one total node, 2 minus 1 is 1, and that means since l is equal to 1, we have one angular nodes, and that leaves us with how many radial nodes?
一个节点，２减去１等于１,因为ｌ等于１,我们有一个角向节点，那剩下径向节点有多少个呢？
-
5 0 The first node will be the to-pull 2, 5 and 0.
第一个节点是可获取的物品。
-
That is to say, I'm going to go back to a node I've already visited.
也就是说我将要,返回我访问过的节点。
-
And also that we know that the zero does not count as a node, if per se I actually had managed to hit zero in drawing that, so the correct answer would be the bottom one there.
另外你们要知道零点不是节点，假设说我确实把零点画成０了，那正确的结果就是底下这个。
-
I'm glad to hear that no one counted this r equal zero as a node.
我很高兴没听到有人把ｒ等于０这处也算作是一个节点。
-
And in terms of radial nodes, we expect to see one node.
对于径向节点，应该有１个。
-
And what is this node going to look like?
这个节点应该是什么样子呢？
-
The point I wanted to make is that for every node, except the leaves, the leaves are the bottom of a tree in this case, are weird, right, they draw trees where the root is at the top, and the leaves are at the bottom.
你没必要看到整棵树，我想说的重点是,对每个节点来说，除了叶子节点,叶子节点指的是树的最下面的节点，电脑科学家都很奇怪,他们画树的时候根是在最上面的。
-
So that's why we have this zero point here, and just to point out again and again and again, it's not a radial node, it's just a point where we're starting our graph, because we're multiplying it by r equals zero.
这就是为什么在这里有个零点，我需要再三强调，这不是径向零点，他只是我们画图的起始处，因为我们用ｒ等于０乘以它。
-
For an angular node, we're just talking about what the l value is, so whatever l is equal to is equal to the number of angular nodes you have.
对于角向节点，我们其实就是在讨论l，的值是多少，因此不管，l，的值等于几,它就等于你所有的角向节点的数目。
应用推荐